Prepositional Phrase Attachment Disambiguation using WordNet
نویسندگان
چکیده
In this thesis we use a knowledge-based approach to disambiguating prepositional phrase attachments in English sentences. This method was first introduced by S. M. Harabagiu. The Penn Treebank corpus is used as the training text. We extract 4-tuples of the form [ V P , NP1, Prep, NP2 ] and sort them into classes according to the semantic relationships between parts of each tuple. These relationships are extracted from WordNet. Classes are sorted into different tiers based on the strictness of their semantic relationship. Disambiguation of prepositional phrase attachments can be cast as a constraint satisfaction problem, where the tiers of extracted classes act as the constraints. Satisfaction is achieved when the strictest possible tier unanimously indicates one kind of attachment. The most challenging kind of problems for disambiguation of prepositional phrases are ones where the prepositional phrase may attach to either the closest verb or noun. We first demonstrate that the best approach to extracting tuples from parsed texts is a top-down postorder traversal algorithm. Following that, the various challenges in forming the prepositional classes utilizing WordNet semantic relations are described. We then discuss the actions that need to be taken towards applying the prepositional classes to the disambiguation task. A novel application of this method is also discussed, by which the tuples to be disambiguated are also expanded via WordNet, thus introducing a client-side application of the algorithms utilized to build prepositional classes. Finally, we present results of different variants of our disambiguating algorithm, contrasting the precision and recall of various combinations of constraints, and comparing our algorithm to a baseline method that falls back to attaching a prepositional phrase to the closest left phrase. Our conclusion is that our algorithm provides improved performance compared to the baseline and is therefore a useful new method of performing knowledge-based disambiguation of prepositional phrase attachments.
منابع مشابه
Acquiring Selectional Preferences from Untagged Text for Prepositional Phrase Attachment Disambiguation
Extracting information automatically from texts for database representation requires previously well-grouped phrases so that entities can be separated adequately. This problem is known as prepositional phrase (PP) attachment disambiguation. Current PP attachment disambiguation systems require an annotated treebank or they use an Internet connection to achieve a precision of more than 90%. Unfor...
متن کاملPrepositional Phrase Attachment through Semantic Association using Connectionist Approach
Determining the correct attachment site for Prepositional Phrase (PP) is one of the major sources of ambiguity in natural language parsing and analysis. In this paper, we describe a neural network based approach to prepositional phrase attachment for natural language text. Our approach disambiguates the attachment site for PP through semantic association among the constituents namely verb, noun...
متن کاملAn Application of WordNet to Prepositional Attachment
This paper presents a method for word sense disambiguation and coherence understanding of prepositional relations. The method relies on information provided by WordNet 1.5. We rst classify preposi-tional attachments according to semantic equivalence of phrase heads and then apply inferential heuristics for understanding the validity of prepositional structures. 1 Problem description In this pap...
متن کاملEnsemble Learning for Low Resources Prepositional Phrase Attachment
Prepositional phrase attachment is a major disambiguation problem when it’s about parsing natural language, for many languages. In this paper a low resources policy is proposed using supervised machine learning algorithms in order to resolve the disambiguation problem of prepositional phrase attachment in Modern Greek. It is a first attempt to resolve prepositional phrase attachment in Modern G...
متن کاملPrepositional Phrase Attachment Ambiguity Resolution Using Semantic Hierarchies
This paper describes a system that resolves prepositional phrase attachment ambiguity in English sentence processing. This attachment problem is ubiquitous in English text, and is widely known as a place where semantics determines syntactic form. The decision is made based on a four-tuple composed of the head verb of the verb phrase, the head noun of the noun phrase, and the preposition and hea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006